Variants of the Hungarian Method for Assignment Problems '

نویسنده

  • H. W.
چکیده

The author p r e s e n t s a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the assignment problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assignment problem and its application in Nigerian institutions: Hungarian method approach

Assignment model is a powerful operations research techniques that can be used to solve assignment or allocation problem. This study applies the assignment model to the course allocation problem in Nigeria tertiary institution in order to maximize lecturers’ effectiveness. A well-structured questionnaire was used to obtain data from lecturers and solved with Hungarian method. The study revealed...

متن کامل

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

A New Method for Finding an Optimal Solution

A new method namely, reduction method is proposed for finding an optimal solution of solid assignment problems. The proposed method does not based on the Hungarian method. With help of a numerical example, the reduction method is illustrated. The solution obtained by the proposed method will help the decision makers to take an appropriate action when they are handling various types of three dim...

متن کامل

Admissible transformations and assignment problems

We introduce the notion of admissible transfomations which is related to the Hungarian method for solving assignment problems. Admissible transformations are stated for linear, quadratic and multi-index assignment problems. Their application to find good lower bounds and/or to solve the problem, respectively, is outlined. Finally it is shown that admissible transformations can also be applied t...

متن کامل

Power Control and Scheduling For Low SNR Region in the Uplink of Two Cell Networks

In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1955